|
|
Transducer Systems and Their Applications
Lupták, Filip ; Krčmář, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis defines a new formal model „transducer system." Transducer system is composed of a number of finite transducers, which cooperate. The thesis examines expressive power of this formal model and shows that transducer system is more powerful than isolated finite transducer. This model is then used to design a parser of arithmetic expressions, which translates them to postfix notation.
|
|
|
Regulated Syntax-Directed Translation
Dvořák, Tomáš ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis deals with formal and syntax directed translation. This thesis contains theoretical part, which defines regular, context free, context sensitive and recursively enumerable languages a grammar. There are given examples of grammars which are able to generate languages that are not context free. Covered by this thesis are matrix grammars, random context grammars and programed grammars. Researched are also finite, pushdown, deep and regular automata, transducers and their part within format syntax directed translation. This project also defines regular transducers based as regulated automata. Thesis defines regulated methods of syntax analysis based on predictive parsers. These methods cover analysis of studied regulated grammars. The final part of this thesis describes new language capable of effective description of these grammars and compiler producing parser code for these grammars written in this new language and their graphical analyzer.
|
|
|
Regulated Syntax-Directed Translation
Dvořák, Tomáš ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis deals with formal and syntax directed translation. This thesis contains theoretical part, which defines regular, context free, context sensitive and recursively enumerable languages a grammar. There are given examples of grammars which are able to generate languages that are not context free. Covered by this thesis are matrix grammars, random context grammars and programed grammars. Researched are also finite, pushdown, deep and regular automata, transducers and their part within format syntax directed translation. This project also defines regular transducers based as regulated automata. Thesis defines regulated methods of syntax analysis based on predictive parsers. These methods cover analysis of studied regulated grammars. The final part of this thesis describes new language capable of effective description of these grammars and compiler producing parser code for these grammars written in this new language and their graphical analyzer.
|
|
|
Transducer Systems and Their Applications
Lupták, Filip ; Krčmář, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis defines a new formal model „transducer system." Transducer system is composed of a number of finite transducers, which cooperate. The thesis examines expressive power of this formal model and shows that transducer system is more powerful than isolated finite transducer. This model is then used to design a parser of arithmetic expressions, which translates them to postfix notation.
|
guest ::
